A Comparison of Normal Cone Conditions for Homotopy Methods for Solving Inequality Constrained Nonlinear Programming Problems
نویسندگان
چکیده
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملA Merit Function for Inequality Constrained Nonlinear Programming Problems
We consider the use of the sequential quadratic programming (SQP) technique for solving the inequality constrained minimization problem min x f(x) subject to: g i (x) 0; i = 1; : : :; m: SQP methods require the use of an auxiliary function, called a merit function or line-search function, for assessing the steps that are generated. We derive a merit function by adding slack variables to create ...
متن کاملa dynamic programming approach for solving nonlinear knapsack problems
nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملOptimality Conditions for Irregular Inequality-Constrained Problems
We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set is not assumed to be regular in the classical sense of Robinson and obtain a constructive description of the tangent cone under a certain new second-order regularity condition. This condition contains classical regularity as a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematical Physics
سال: 2020
ISSN: 1687-9120,1687-9139
DOI: 10.1155/2020/5483587